On real-time partitioned multicore systems
نویسندگان
چکیده
منابع مشابه
Multicore partitioned systems based on hypervisor
Multi-core processors are increasingly being considered to provide the performance required by future safety critical systems. In some domains like space, it is specially significant due to the processor technology frequency is limited by the presence of radiation. In that case, the way to increase computing power can be achieved by the use of multi-core systems. There is a number of challenges...
متن کاملMulticore Applications in Real Time Systems
Microprocessor roadmaps clearly show a trend towards multiple core CPUs. Modern operating systems already make use of these CPU architectures by distributing tasks between processing cores thereby increasing system performance. This review article highlights a brief introduction of what a multicore system is, the various methods adopted to program these systems and also the industrial applicati...
متن کاملImplementing Real-time Partitioned Convolution Algorithms on Conventional Operating Systems
We describe techniques for implementing real-time partitioned convolution algorithms on conventional operating systems using two different scheduling paradigms: time-distributed (cooperative) and multi-threaded (preemptive). We discuss the optimizations applied to both implementations and present measurements of their performance for a range of impulse response lengths on a recent high-end desk...
متن کاملXoncrete: a scheduling tool for partitioned real-time systems
ARINC 653 defines a partitioned framework where the partitions are scheduled according to a predefined cyclic plan and the processes of each partition are scheduled with a fixed priority policy. The timing characteristics defined in ARINC (period and duration) can hardly be used to precisely represent the timing requirements of the applications. We extend the timing model of ARINC 653 to consid...
متن کاملRobust Partitioned Scheduling for Real-Time Multiprocessor Systems
In this paper, we consider the problem of fixed-priority partitioned scheduling of sporadic real-time tasks for homogeneous processors. We propose a partitioning heuristic that takes into account possible Worst Case Execution Time (WCET) overruns. Our goal is to maximize the duration a task can be allowed to exceed its WCET without compromising the timeliness constraints of all the tasks. This ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGAda Ada Letters
سال: 2013
ISSN: 1094-3641
DOI: 10.1145/2552999.2553003